Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
131	4-critical graphs on surfaces without contractible (≤ 4)-cycles Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y† Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:44:46 Graph coloring Planar graphs Chordal graph Outerplanar graph Dual graph
132	SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 1800–1813 c 2009 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2010-04-26 06:33:56 NP-complete problems Trapezoid graph Graph coloring Independent set Intersection graph Interval graph Clique Perfect graph Pathwidth Planar graph
133	Colouring Graphs When the Number of Colours is Almost the Maximum Degree∗ Michael Molloy Dept of Computer Science, University of Toronto 10 Kings College Rd. Toronto, ON, Canada, M5S 3G4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-01-05 22:31:04 Graph coloring Graph theory Graph operations Clique Degree Neighbourhood Graph Perfect graph theorem Extremal graph theory
134	Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma† Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:03 Morphisms Graph theory NP-complete problems Graph coloring Graph operations Pathwidth Graph homomorphism Treewidth Cograph Graph isomorphism Indifference graph Clique-width
135	M:RA35_31FINITCE IALA IALA.dvi Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-12-02 16:52:35 Graph coloring Subcoloring Line graph Petersen graph Edge coloring Graph Planar graph Clique Matching Bipartite graph Monochromatic triangle Treewidth
136	Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2015-01-20 10:45:26 Graph coloring Hypergraphs NP-complete problems Vertex cover Edge coloring Matching Constraint programming ErdsFaberLovsz conjecture Constraint graph
137	Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:28:57 Graph theory NP-complete problems Graph connectivity Graph minor Graph operations Graph coloring Graph K-edge-connected graph Degree Tree Planar graph Line graph
138	The Complexity of Rationalizing Network Formation Shankar Kalyanaraman Computer Science Department California Institute of Technology Pasadena, CAEmail: Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2009-08-11 16:34:41 Graph coloring Computational problems Combinatorial optimization Matching Graph minor Gap reduction Shortest path problem Sharp-P-completeness of 01-permanent
139	coloring triangle-free planar graphs with a precolored 9-cycle Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2015-01-29 17:07:54 Graph coloring Planar graph Nowhere-zero flow Four color theorem Chordal graph Triangle-free graph Interval edge coloring Outerplanar graph
140	0 AHLIN and REITER PROBLEM DEPARTMENT ASHLEY AHLIN Add to Reading List Source URL: www.pme-math.org Language: English - Date: 2013-10-17 15:53:04 Graph coloring Chordal graph